Approximating Bandwidth by Mixing Layouts of Interval Graphs
نویسندگان
چکیده
منابع مشابه
Approximating Bandwidth by Mixing Layouts of Interval Graphs
We examine the bandwidth problem in circular-arc graphs, chordal graphs with a bounded number of leaves in the clique tree, and k-polygon graphs (fixed k). We show that all of these graph classes admit efficient approximation algorithms which are based on exact or approximate bandwidth layouts of related interval graphs. Specifically, we obtain a bandwidth approximation algorithm for circular-a...
متن کاملOn the bandwidth of Mobius graphs
Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.
متن کاملApproximating Bandwidth
is minimized. We denote B(G) = minf B(G, f) to be the bandwidth of G. This is equivalent to the matrix bandwidth minimization problem, which is the form it was introduced in the 1960s. In the matrix version of the problem, a symmetric matrix M is given, and the goal is to find a permuation matrix P such that the nonzero entries of PMP are all within a “band of minimum width” about the diagonal....
متن کاملApproximating the Bandwidth for Asteroidal Triple-Free Graphs
We show that there is an O(n3) algorithm to approximate the bandwidth of an AT-free graph with worst case performance ratio 2. Alternatively, at the cost of the approximation factor, we can also obtain an O(e + n logn) algorithm to approximate the bandwidth of an AT-free graph within a factor 4 and anO(n+ e) algorithm with a factor 6. For the special cases of permutation graphs and trapezoid gr...
متن کاملTrack Layouts of Graphs
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v Résumé . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii Declaration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xii List of Figures . . . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 1999
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80035-6